On the Other Hand, for a Rational Map F of Degree D Such That 1 2 F the Following
ثبت نشده
چکیده
inequality is known to hold and be best possible [2]: H-dimJ f log d log K 0 ; where K 0 = max z2J f jf 0 (z)j: In our present case, d = 2 and K 0 = 2 = 1 + p 1 0 4c; thus we have H-dimJ c log 2 log(1 + p 1 0 4c) : Therefore, it seems that our estimate is suciently good at least in case c < 02: References
منابع مشابه
On a functional equation for symmetric linear operators on $C^{*}$ algebras
Let $A$ be a $C^{*}$ algebra, $T: Arightarrow A$ be a linear map which satisfies the functional equation $T(x)T(y)=T^{2}(xy),;;T(x^{*})=T(x)^{*} $. We prove that under each of the following conditions, $T$ must be the trivial map $T(x)=lambda x$ for some $lambda in mathbb{R}$: i) $A$ is a simple $C^{*}$-algebra. ii) $A$ is unital with trivial center and has a faithful trace such ...
متن کاملOn endomorphisms of projective bundles
Let X be a projective bundle. We prove that X admits an endomorphism of degree > 1 and commuting with the projection to the base, if and only if X trivializes after a finite covering. When X is the projectivization of a vector bundle E of rank 2, we prove that it has an endomorphism of degree > 1 on a general fiber only if E splits after a finite base change. It is clear that, for a complex pro...
متن کاملDynamics and Rational Maps a New Section for Chapter 7 of the Arithmetic of Dynamical Systems
N be a rational map, where f 0 ,. .. , f N are homogeneous polynomials of degree d with no common factors. Then φ is defined at all points not in the indeterminacy locus Z(φ) = { P ∈ P N : f 0 (P) = · · · = f N (P) = 0 }. The map φ is said to be dominant if the image φ (P N Z(φ)) is Zariski dense, i.e., does not lie in a proper algebraic subset of P N. Alternatively, the map φ is dominant if th...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کامل